Guarding the Vertices of an Orthogonal Terrain using Vertex Guards
نویسنده
چکیده
A terrain T is an x-monotone polygonal chain in the plane; T is orthogonal if each edge of T is either horizontal or vertical. In this paper, we give an exact algorithm for the problem of guarding the convex vertices of an orthogonal terrain with the minimum number of reflex vertices.
منابع مشابه
Guarding Orthogonal Terrains
A 1.5-dimensional terrain T with n vertices is an xmonotone polygonal chain in the plane. A point guard p on T guards a point q of T if the line segment connecting p to q lies on or above T ; p is a vertex guard if it is a vertex of T . In the Optimal Terrain Guarding (OTG) problem on T , the objective is to guard the vertices of T by the minimum number of vertex guards. King and Krohn [9] show...
متن کاملOrthogonal Terrain Guarding is NP-complete
A terrain is an x-monotone polygonal curve, i.e., successive vertices have increasing x-coordinates. Terrain Guarding can be seen as a special case of the famous art gallery problem where one has to place at most k guards on a terrain made of n vertices in order to fully see it. In 2010, King and Krohn showed that Terrain Guarding is NP-complete [SODA ’10, SIAM J. Comput. ’11] thereby solving a...
متن کاملOpen Problems from CCCG 2014
This report provides the problems posed by the participants at the open problem session of the 26 Canadian Conference on Computational Geometry. This well-attended session was held Tuesday, August 12, 2014, as a scheduled session of the conference. Six participants presented a total of seven problems. All presenters kindly agreed to provide written versions of their problems, including referenc...
متن کاملGuarding Polyhedral Terrains
We prove that [n/2J vertex guards are always sufficient and sometimes necessary to guard the surface of an n-vertex polyhedral terrain. We also show that l(4n 4)/13J edge guards are sometimes necessary to guard the surface of an n-vertex polyhedral terrain. The upper bound on the number of edge guards is ln/3J (Everett and Rivera-Campo, 1994). Since both upper bounds are based on the four color...
متن کاملEfficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain
We present eecient polynomial time algorithms that place bn=2c vertex guards which cover the surface of an n-vertex polyhedral terrain, and similarly, bn=3c edge guards which cover the surface of an n-vertex polyhedral terrain. The time complexity of both algorithms, dominated by the cost of nding a maximum matching in a graph, is O(n 3=2).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1512.08292 شماره
صفحات -
تاریخ انتشار 2015